Large-scale convex optimization for ultra-dense cloud-RAN
نویسندگان
چکیده
منابع مشابه
Large-Scale Human Activity Recognition Using Ultra-Dense Sensing
Introduction The ability to build computing systems that can observe, understand and act on day-today physical human activity has long been a goal of computing research. Such systems could have profound conceptual and practical implications. Since the ability to reason and act based on activity is one of the central aspects of human intelligence, from a conceptual viewpoint such a system could ...
متن کاملIncremental proximal methods for large scale convex optimization
Abstract We consider the minimization of a sum Pm i=1 fi(x) consisting of a large number of convex component functions fi. For this problem, incremental methods consisting of gradient or subgradient iterations applied to single components have proved very effective. We propose new incremental methods, consisting of proximal iterations applied to single components, as well as combinations of gra...
متن کاملOn Lower Complexity Bounds for Large-Scale Smooth Convex Optimization
We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Hölder continuous, with a given exponent and constant, gradient) convex functions over high-dimensional ‖ · ‖p-balls, 1 ≤ p ≤ ∞. Our bounds turn out to be tight (up to logarithmic in the design dimension factors), and can be viewed as a substanti...
متن کاملA Line Search Multigrid Method for Large-scale Convex Optimization
Abstract. We present a line search multigrid method based on Nash’s MG/OPT multilevel optimization approach for solving discretized versions of convex infinite dimensional optimization problems. Global convergence is proved under fairly minimal requirements on the minimization method used at all grid levels. In particular, our convergence proof does not require that these minimization, or so-ca...
متن کاملA Multilevel Proximal Algorithm for Large Scale Composite Convex Optimization
Composite convex optimization models consist of the minimization of the sum of a smooth convex function and a non-smooth convex function. Such models arise in many applications where, in addition to the composite nature of the objective function, a hierarchy of models is readily available. It is common to take advantage of this hierarchy of models by first solving a low fidelity model and then ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Wireless Communications
سال: 2015
ISSN: 1536-1284
DOI: 10.1109/mwc.2015.7143330